On the facial structure of Symmetric and Graphical Traveling Salesman Polyhedra
نویسنده
چکیده
The Symmetric Traveling Salesman Polytope Sn for a fixed number n of cities is a face of the corresponding Graphical Traveling Salesman Polyhedron Pn. This has been used to study facets of Sn using Pn as a tool. In this paper, we study the operation of “rotating” (or “lifting”) valid inequalities for Sn to obtain a valid inequalities for Pn. As an application, we describe a surprising relationship between (a) the parsimonious property of relaxations of the Symmetric Traveling Salesman Polytope and (b) a connectivity property of the ridge graph of the Graphical Traveling Salesman Polyhedron. CONTENTS
منابع مشابه
The Graphical Traveling Salesman Polyhedron Is the Intersection of the Positive Orthant with the Minkowski Sum of the Symmetric Traveling Salesman Polytope and the Polar of the Metric Cone
In this short communication, we observe that the Graphical Traveling Salesman Polyhedron is the intersection of the positive orthant with the Minkowski sum of the Symmetric Traveling Salesman Polytope and the polar of the metric cone. This follows trivially from known facts. There are two reasons why we find this observation worth communicating none-the-less: It is very surprising; it helps to ...
متن کاملOn the graphical relaxation of the symmetric traveling salesman polytope
Abstract. The Graphical Traveling Salesman Polyhedron (GTSP) has been proposed by Naddef and Rinaldi to be viewed as a relaxation of the Symmetric Traveling Salesman Polytope (STSP). It has also been employed by Applegate, Bixby, Chvátal, and Cook for solving the latter to optimality by the Branch-and-Cut method. There is a close natural connection between the two polyhedra. Until now, it was n...
متن کاملNot Every GTSP Facet Induces an STSP Facet
The graphical traveling salesman problem (GTSP) has been studied as a variant of the classical symmetric traveling salesman problem (STSP) suited particularly for sparse graphs. In addition, it can be viewed as a relaxation of the STSP and employed for solving the latter to optimality as originally proposed by Naddef and Rinaldi. There is a close natural connection between the two associated po...
متن کاملOn the Parsimonious Property of Relaxations of the Symmetric Traveling Salesman Polytope
We relate the parsimonious property of relaxations of the Symmetric Traveling Salesman Polytope to a connectivity property of the ridge graph of the Graphical Traveling Salesman Polyhedron. This relationship is quite surprising. The proof is elegant and geometric: it makes use of recent results on “flattening” parts of the boundary complex of the polar of the Graphical Traveling Salesman Polyhe...
متن کاملSolving Traveling Salesman Problem based on Biogeography-based Optimization and Edge Assembly Cross-over
Biogeography-Based Optimization (BBO) algorithm has recently been of great interest to researchers for simplicity of implementation, efficiency, and the low number of parameters. The BBO Algorithm in optimization problems is one of the new algorithms which have been developed based on the biogeography concept. This algorithm uses the idea of animal migration to find suitable habitats for solvin...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Optimization
دوره 12 شماره
صفحات -
تاریخ انتشار 2014